Homomorphic Conditional Expectations as Noncommutative Retractions
نویسنده
چکیده
Let A be a C∗-algebra and E : A → A a conditional expectation. The Kadison-Schwarz inequality for completely positive maps, E(x)∗E(x) ≤ E(x∗x), implies that ‖E(x)‖ ≤ ‖E(x∗x)‖ . In this note we show that E is homomorphic (in the sense that E(xy) = E(x)E(y) for every x, y in A) if and only if ‖E(x)‖ = ‖E(x∗x)‖ , for every x in A. We also prove that a homomorphic conditional expectation on a commutative C∗-algebra C0(X) is given by composition with a continuous retraction of X. One may therefore consider homomorphic conditional expectations as noncommutative retractions.
منابع مشابه
The Universal A-Dynamical System
For any C∗-algebra A, an A-dynamical system is a C∗-dynamical system that contains A and can be generated by the images of A under the semigroup of nonnegative time endomorphisms. There is a universal Adynamical system that occupies a position in noncommutative dynamics that resembles the position of the tangent bundle in commutative dynamics. We describe an approach to noncommutative dilation ...
متن کاملThe Pythagorean Theorem: I. The finite case.
The Pythagorean Theorem and variants of it are studied. The variations evolve to a formulation in terms of noncommutative, conditional expectations on von Neumann algebras that displays the theorem as the basic result of noncommutative, metric, Euclidean Geometry. The emphasis in the present article is finite dimensionality, both "discrete" and "continuous."
متن کاملIndependence and Product Systems
Starting from elementary considerations about independence and Markov processes in classical probability we arrive at the new concept of conditional monotone independence (or operator-valued monotone independence). With the help of product systems of Hilbert modules we show that monotone conditional independence arises naturally in dilation theory. One of the most fundamental concepts in probab...
متن کاملNoise-free Symmetric Fully Homomorphic Encryption based on noncommutative rings
In this paper, we propose a noise-free symmetric fully homomorphic encryption (FHE) based on matrices over noncommutative rings. The scheme is secure against chosen plaintext attacks based on the factorization problem of matrices over noncommutative rings as well as the hardness of an overdefined system of multivariate polynomial equations over the given non-commutative algebraic structure. Mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017